Variable elimination for building interpreters
نویسندگان
چکیده
In this paper, we build an interpreter by reusing host language functions instead of recoding mechanisms of function application that are already available in the host language (the language which is used to build the interpreter). In order to transform user-defined functions into host language functions we use combinatory logic : λ-abstractions are transformed into a composition of combinators. We provide a mechanically checked proof that this step is correct for the call-by-value strategy with imperative features.
منابع مشابه
DP — A System for Reasoning with Supernormal Defaults
DP is a top-down theorem prover for supernormal or Poole-type defaults. Axioms and defaults can be arbitrary clauses, i.e. it supports disjunctions and (real) classical negation. Multiple disjunctions can be handled credulously, skeptically, and carefully. In skeptical mode, the expressivity of supernormal defaults corresponds to variable circumscription. The system is based on model eliminatio...
متن کاملModel Elimination, Logic Programming and Computing Answers
We demonstrate that theorem provers using model elimination (ME) can be used as answer complete interpreters for disjunctive logic programming. More specifically, we introduce a mechanism for computing answers into the restart variant of ME. Building on this, we develop a new calculus called ancestry restart ME. This variant admits a more restrictive regularity restriction than restart ME, and,...
متن کاملComputing Answers with Model Elimination
We demonstrate that theorem provers using model elimination (ME) can be used as answer-complete interpreters for disjunctive logic programming. More specifically, we introduce a mechanism for computing answers into the restart variant of ME. Building on this we develop a new calculus called ancestry restart ME. This variant admits a more restrictive regularity restriction than restart ME, and, ...
متن کاملProlog Meta-interpreters for Rulebased Inference under Uncertainty
Uncertain facts and inexact rules can be represented and processed in standard Prolog through meta-interpretation. This requires the specification of appropriate parsers and belief calculi. We present a meta-interpreter that takes a rule-based belief calculus as an external variable. The certainty-factors calculus and a heuristic Bayesian belief-update model are then implemented as stand-alone ...
متن کاملAn Optimizing Compiler for CLP(R)
The considerable expressive power and exibility gained by combining constraint programming with logic programming is not without cost. Implementations of constraint logic programming (CLP) languages must include expensive constraint solving algorithms tailored to speciic domains, such as trees, Booleans, or real numbers. The performance of many current CLP compilers and interpreters does not en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1005.1466 شماره
صفحات -
تاریخ انتشار 2010